翻訳と辞書 Words near each other ・ Yaki udon ・ Yaki Yen ・ Yaki-Da ・ Yakich ・ Yakima (disambiguation) ・ Yakima Air Terminal ・ Yakima Area Arboretum ・ Yakima Bears ・ Yakima Brewing ・ Yakima Canutt ・ Yajurveda ・ Yajurvedi ・ Yajurvindra Singh ・ Yajuvendra Krishanatry ・ Yak ・ YAK (cryptography) ・ Yak (disambiguation) ・ Yak Attack ・ Yak Bak ・ Yak Ballz ・ Yak Bondy ・ Yak butter ・ Yak Butter Blues ・ Yak fiber ・ Yak lace ・ Yak Misraee Nazm ・ Yak Peak ・ Yak polo ・ Yak racing ・ Yak shaving Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク YAK (cryptography) ： ウィキペディア英語版 YAK (cryptography) The YAK is a public-key authenticated key agreement protocol.〔F. Hao, (On Robust Key Agreement Based on Public Key Authentication ). ''Proceedings of the 14th International Conference on Financial Cryptography and Data Security, Tenerife, Spain, LNCS 6052, pp. 383–390, Jan, 2010.〕 It is considered the simplest among the related protocols, including MQV, HMQV, Station-to-Station protocol, SSL/TLS etc. The authentication is based on public key pairs. As with other protocols, YAK normally requires a Public Key Infrastructure to distribute authentic public keys to the communicating parties. The author suggests that YAK may be unencumbered by patent. ==Description== Two parties, Alice and Bob, agree on a group $G$ with generator $g$ of prime order $q$ in which the discrete log problem is hard. Typically a Schnorr group is used. In general, YAK can use any prime order group that is suitable for public key cryptography, including elliptic curve cryptography. Let $g^a$ be Alice's long-term public key and $g^b$ be Bob's. The protocol executes in one round: Alice selects $x\; \backslash in\_\backslash text\; (q-1)$ and sends out $g^x$ together with a zero-knowledge proof (using for example Schnorr signature) for the proof of the exponent $x$. Similarly, Bob selects $y\; \backslash in\_\backslash text\; (q-1)$ and sends out $g^$ together with a zero-knowledge proof for the proof of the exponent $y$. Here, the notation $\backslash in\_\backslash text$ denotes ''an element selected randomly with uniform probability''. The above communication can be completed in one round as neither party depends on the other. When it finishes, Alice and Bob verify the received zero-knowledge proofs. Alice then computes $K\; =\; (g^\; g^)\; ^\; =\; g^$. Similarly, Bob computes $K\; =\; (g^\; g^)\; ^\; =\; g^$. With the same keying material $K$, Alice and Bob can derive a session key using a cryptographic hash function: $\backslash kappa\; =\; H(K)$. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「YAK (cryptography)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.